Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand, canonicity of modal formulae is important, too, because it implies frame-completeness of logics axiomatized with canonical formulae. Computing a first-order equivalent of a modal formula amounts to elimination of second-order quantifiers. Two algorithms have been developed for second-order quantifier elimination: SCAN, based on constraint resolution, and DLS, based on a logical equivalence established by Ackermann. In this paper we introduce a new algorithm, SQEMA, for computing first-order equivalents (using a modal version of Ackermann's lemma) and, moreover, for proving canonicity of modal formulae. Unlike SCAN and DLS, it works directly on modal formulae, thus avoiding Skolemization and the subsequent problem of unskolemization. We present the core algorithm and illustrate it with some examples. We then prove its correctness and the canonicity of all formulae on which the algorithm succeeds. We show that it succeeds not only on all Sahlqvist formulae, but also on the larger class of inductive formulae, introduced in our earlier papers. Thus, we develop a purely algorithmic approach to proving canonical completeness in modal logic and, in particular, establish one of the most general completeness results in modal logic so far.Comment: 26 pages, no figures, to appear in the Logical Methods in Computer Scienc

Singly generated quasivarieties and residuated structures

A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A. A consequence of this demand, called "passive structural completeness" (PSC), is that the nontrivial members of K all satisfy the same existential positive sentences. We prove that if K is PSC then it still has the JEP, and if it has the JEP and its nontrivial members lack trivial subalgebras, then its relatively simple members all belong to the universal class generated by one of them. Under these conditions, if K is relatively semisimple then it is generated by one K-simple algebra. It is a minimal quasivariety if, moreover, it is PSC but fails to unify some finite set of equations. We also prove that a quasivariety of finite type, with a finite nontrivial member, is PSC iff its nontrivial members have a common retract. The theory is then applied to the variety of De Morgan monoids, where we isolate the sub(quasi)varieties that are PSC and those that have the JEP, while throwing fresh light on those that are structurally complete. The results illuminate the extension lattices of intuitionistic and relevance logics

Moving up and down in the generic multiverse

We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of". The fragment of the first relation is called the modal logic of forcing and was studied by us in earlier work. The fragment of the second relation is called the modal logic of grounds and will be studied here for the first time. In addition, we discuss which combinations of modal logics are possible for the two fragments.Comment: 10 pages. Extended abstract. Questions and commentary concerning this article can be made at http://jdh.hamkins.org/up-and-down-in-the-generic-multiverse

Changing a semantics: opportunism or courage?

The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic. Even so, discussion has persisted about their technical status, and perhaps even their conceptual legitimacy. This paper gives a systematic view of generalized model techniques, discusses what they mean in mathematical and philosophical terms, and presents a few technical themes and results about their role in algebraic representation, calibrating provability, lowering complexity, understanding fixed-point logics, and achieving set-theoretic absoluteness. We also show how thinking about Henkin's approach to semantics of logical systems in this generality can yield new results, dispelling the impression of adhocness. This paper is dedicated to Leon Henkin, a deep logician who has changed the way we all work, while also being an always open, modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and Alonso, E., 201

Impact of renal impairment on atrial fibrillation: ESC-EHRA EORP-AF Long-Term General Registry

Background: Atrial fibrillation (AF) and renal impairment share a bidirectional relationship with important pathophysiological interactions. We evaluated the impact of renal impairment in a contemporary cohort of patients with AF. Methods: We utilised the ESC-EHRA EORP-AF Long-Term General Registry. Outcomes were analysed according to renal function by CKD-EPI equation. The primary endpoint was a composite of thromboembolism, major bleeding, acute coronary syndrome and all-cause death. Secondary endpoints were each of these separately including ischaemic stroke, haemorrhagic event, intracranial haemorrhage, cardiovascular death and hospital admission. Results: A total of 9306 patients were included. The distribution of patients with no, mild, moderate and severe renal impairment at baseline were 16.9%, 49.3%, 30% and 3.8%, respectively. AF patients with impaired renal function were older, more likely to be females, had worse cardiac imaging parameters and multiple comorbidities. Among patients with an indication for anticoagulation, prescription of these agents was reduced in those with severe renal impairment, p <.001. Over 24 months, impaired renal function was associated with significantly greater incidence of the primary composite outcome and all secondary outcomes. Multivariable Cox regression analysis demonstrated an inverse relationship between eGFR and the primary outcome (HR 1.07 [95% CI, 1.01–1.14] per 10 ml/min/1.73 m2 decrease), that was most notable in patients with eGFR <30 ml/min/1.73 m2 (HR 2.21 [95% CI, 1.23–3.99] compared to eGFR ≥90 ml/min/1.73 m2). Conclusion: A significant proportion of patients with AF suffer from concomitant renal impairment which impacts their overall management. Furthermore, renal impairment is an independent predictor of major adverse events including thromboembolism, major bleeding, acute coronary syndrome and all-cause death in patients with AF